// Problem: 
// Contest: 
// URL: 
// Memory Limit: 
// Time Limit: 
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read(){
	int s=0,w=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
	while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
	return s*w;
}
const int N=1e9+7;
signed main()
{
	int t=1;
//	cin>>t;
	while(t--)
	{
		int n,m;
		cin>>n>>m;
		vector<vector<vector<int>>> dp(n+m+1,vector<vector<int>>(m+1,vector<int>(m+1)));
		dp[0][0][2]=1;
		for(int i=0;i<n+m;i++)
		{
			for(int j=0;j<m;j++)
			{
				for(int k=0;k<=m;k++)
				{
					if(dp[i][j][k])
					{
						if(k>0)dp[i+1][j+1][k-1]=(dp[i+1][j+1][k-1]+dp[i][j][k])%N;
						if(k<=m/2)dp[i+1][j][k*2]=(dp[i+1][j][k*2]+dp[i][j][k])%N;
					}
				}
			}
		}
		cout<<dp[n+m][m][0];
		
	}
	return 0;
}
